class Solution {
public:
    vector<vector<int>> v;
    vector<int> path;
    bool check[10]{false};
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        dfs(nums,0);
        return v;
    }

    void dfs(vector<int>& nums,int pos)
    {
        if(pos==nums.size())
        {
            v.push_back(path);
            return;
        }

        for(int i=0;i<nums.size();++i)
        {
            if((check[i]==false)&&(i==0||nums[i]!=nums[i-1]
            ||check[i-1]==true))
            {
                path.push_back(nums[i]);
                check[i]=true;
                dfs(nums,pos+1);
                path.pop_back();
                check[i]=false;
            }
        }
    }
};
